The Generation of Bidding Rules for Auction-based Robot Coordination

نویسندگان

  • Craig Tovey
  • Michail G. Lagoudakis
  • Sonal Jain
  • Sven Koenig
چکیده

Robotics researchers have used auction-based coordination systems for robot teams because of their robustness and efficiency. However, there is no research into systematic methods for deriving appropriate bidding rules for given team objectives. In this paper, we propose the first such method and demonstrate it by deriving bidding rules for three possible team objectives of a multi-robot exploration task. We demonstrate experimentally that the resulting bidding rules indeed exhibit good performance for their respective team objectives and compare favorably to the optimal performance. Our research thus allows the designers of auction-based coordination systems to focus on developing appropriate team objectives, for which good bidding rules can then be derived automatically.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Auction-Based Multi-Robot Routing

Recently, auction methods have been investigated as effective, decentralized methods for multi-robot coordination. Experimental research has shown great potential, but has not been complemented yet by theoretical analysis. In this paper we contribute a theoretical analysis of the performance of auction methods for multi-robot routing. We suggest a generic framework for auction-based multi-robot...

متن کامل

Probabilistic GENCOs Bidding Strategy in Restructured Two-Side Auction Power Markets

As a matter of course, power market uncertainties escalation is by product of power industry restructure on one hand and the unrivalled penetration of renewable energies on the other. Generally, the decision making process in such an uncertain environment faces with different risks. In addition, the performance of real power markets is very close to oligopoly markets, in which, some market play...

متن کامل

Auction – Based Robot Coordination

We study how to improve sequential single-item auctions that assign targets to robots for exploration tasks such as environmental clean-up, space-exploration, and search and rescue missions. We exploit the insight that the resulting travel distances are small if the bidding and winner-determination rules are designed to result in hillclimbing, namely to assign an additional target to a robot in...

متن کامل

Optimized Algorithms for Multi-Agent Routing (Short Paper)

Auction methods have been successfully used for coordinating teams of robots in the multi-robot routing problem, a representative domain for multi-agent coordination. Solutions to this problem typically use bids computed using the shortest distance between various locations on a map. But, the cost of this shortest-distance computation has not been considered in previous research. This paper pre...

متن کامل

استراتژی بهینه پیشنهاد قیمت ـ توان برای واحدهای تولید با لحاظ عدم قطعیت قیمت

In restructured power systems, generation companies should offer a power - price curve to the market operator to participate the auction. The proposed bidding curve has a considerable impact on the unit profit, especially in pay as bid markets. The optimal bidding curve depends on the final market clearing price which is uncertain in the stage of bidding. This paper proposes a novel approach f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004